Solving Multilinear Systems via Tensor Inversion
نویسندگان
چکیده
منابع مشابه
Solving Multilinear Systems via Tensor Inversion
Higher order tensor inversion is possible for even order. This is due to the fact that a tensor group endowed with the contracted product is isomorphic to the general linear group of degree n. With these isomorphic group structures, we derive a tensor SVD which we have shown to be equivalent to well-known canonical polyadic decomposition and multilinear SVD provided that some constraints are sa...
متن کاملMultilinear Dynamical Systems for Tensor Time Series
Data in the sciences frequently occur as sequences of multidimensional arrays called tensors. How can hidden, evolving trends in such data be extracted while preserving the tensor structure? The model that is traditionally used is the linear dynamical system (LDS) with Gaussian noise, which treats the latent state and observation at each time slice as a vector. We present the multilinear dynami...
متن کاملTensor network complexity of multilinear maps
We study tensor networks as a model of arithmetic computation for evaluating multilinear maps. This model turns out to be strong enough to capture the current best algorithms for a variety of problems, e.g., O(n ) time matrix multiplication, O(n logn) time discrete Fourier transform, O(n ) time 3t-clique counting and O∗(2n) time for computing the permanent of a matrix. For counting homomorphism...
متن کاملMultilinear Tensor Regression for Longitudinal Relational Data.
A fundamental aspect of relational data, such as from a social network, is the possibility of dependence among the relations. In particular, the relations between members of one pair of nodes may have an effect on the relations between members of another pair. This article develops a type of regression model to estimate such effects in the context of longitudinal and multivariate relational dat...
متن کاملSolving Nonlinear Systems by Constraint Inversion and Interval Arithmetic
A reliable symbolic-numeric algorithm for solving nonlinear systems over the reals is designed. The symbolic step generates a new system, such the formulas are different but the solutions are preserved, through partial factorizations of polynomial expressions, and constraint inversion. The numeric step is a branch-and-prune algorithm based on interval constraint propagation to compute a set of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2013
ISSN: 0895-4798,1095-7162
DOI: 10.1137/100804577